Step of Proof: ax_choice |
12,41 |
|
Inference at * 1
Iof proof for Lemma ax choice:
1. A : Type
2. B : Type
3. Q : A
B

4.
x:A.
y:B. Q(x,y)
f:A
B. (
x:A. Q(x,f(x)))
by ((Unfolds ``all exists`` 4)
CollapseTHEN (RenameVar `g' 4))
C1:
C1: 4. x:A
y:B
Q(x,y)
C1:
f:A
B. (
x:A. Q(x,f(x)))
C.